#include <iostream>
#include "BinaryTree.h"

int main()
{
    BinaryTree tree;
    int a[5] = {1,2,3,4,5};
    for(int i = 0; i < 5; i++)
    {
        tree.Insert(&a[i]);
    }
    tree.show();

    if(tree.IscomBinaryTree() == 0)
    {
        std::cout<<"不是完全二叉树"<<std::endl;
    }
    else
        std::cout<<"是完全二叉树"<<std::endl;

    return 0;
}